Add and remove operations are typically expensive since binary search trees require that a tree be balanced 通常需要增加和删除操作，因为二叉树需要被平衡。
Simple binary tree class - binary search trees are useful for finding items in a list that changes infrequently 二叉搜索树在查找经常变化的列表时是很非常有用的。
This method performs a binary search ; however , the elements are moved up to fill in the open spot , so this method is an o 此方法执行二进制搜索，但会上移元素以填充空白区域，因此，此方法的运算复杂度为o (
The split of search space can be described as a virtue binary search tree and the info - search process is similar to the search in the binary tree 在此基础上，信息的搜索就可描述为二进制搜索树的查找过程。
Using a binary search tree or dividing the string into segments as long as the square root of the length of the string will solve the problem 用一个二叉搜索树或者将串切分成长度的平方根那么长的小段都可以解决这个问题。
If the search is time - critical , a binary search or hash table lookup is almost always best , but as with sorting , you must keep locality in mind 如果搜索是时间关键的，二进制搜索或者哈希表查找几乎总是最好的，但是与排序一样，必须记住地址。
A linear search through a small array can be faster than a binary search through a data structure with a lot of pointers that causes page faults or cache misses 如果二进制搜索通过的数据结构具有许多导致页错误或缓存未命中的指针，则通过小数组的线性搜索可以比二进制搜索快。
In the above example , a simple hashmap or binary search tree could have easily solved the problem , but implementing one of these data structures in xsl would be inconvenient and unnecessary 在上面的示例中，如果使用一个简单的散列图（ hashmap ）或二进制搜索树就可以轻易地解决问题，但是用xsl实现一个这样的数据结构并不是很方便，并且是不必要的。
In the process of developing software , the " binary search " is used to search the " character model " of the characters displayed . the display quality is improved by this means . the real - time process of tester is kept by the method called " time - interrupt " 在软件程序的设计中，采用“折半查找”的快速查找方法完成对显示字符“字模”的查找，改善显示画面的质量；采用“定时中断”的方法保证了测试仪进行参数测量时的实时性。
According to the definitions of bottleneck bandwidth , available bandwidth and bulk transfer capacity , we analyzed the algorithms which named vps ( variable packet size ) , pptd ( packet pair / train dispersion ) , slops ( self - loading periodic streams ) and topp ( trains of packet pairs ) ; based on the principle of sub - path bottleneck measurement , we developed the bottleneck measurement algorithm using heterogenous packet - pair train ; after designing the three child algorithms ( demarcating bandwidth range , approaching bandwidth value and predicting the trendency of available bandwidth fluctuation ) , we performed the algorithm called self - loading binary search ; applying the multi - home properties of sctp ( stream controltransmission protocol ) and measurement algorithm of available bandwidth , we presented a scheme to adjust the sctp transport path when there are network congestions or faults ; by the library of winsock and winpcap , we developed a measurement program to look for bottleneck bandwidth . in ns2 experiments , the algorithm based on heterogenous packet - pair train fitted well , and the algorithm of self - loading binary search worked quickly , and the sctp scheme improved the throughput effectively 本文根据瓶颈带宽、可用带宽和btc ( bulktransfercapacity )三类网络带宽定义,分析了vps ( variablepacketsize )和pptd ( packetpair / traindispersion )瓶颈带宽测试算法, slops ( self - loadingperiodicstreams )和topp ( trainsofpacketpairs )可用带宽测试算法;基于子路径瓶颈测试原理,设计了异构包对序列的瓶颈测试算法;并结合三个子算法(界定带宽范围算法、接近带宽值算法和带宽变化趋势判定算法) ,设计了自载流折半查找的可用带宽测试算法;把上面的算法应用到sctp ( streamcontroltransmissionprotocal )的多宿性和可用带宽测试,提出了一个网络拥塞或故障时调整sctp传输路径的方案;结合winsock和winpcap两套网络开发工具,设计了一个瓶颈带宽测试程序;通过ns2仿真实验,验证了基于异构包对序列瓶颈测试算法的准确性、自载流折半查找算法的快速性,和sctp改进方案的有效性。
